Noisy Broadcast Networks With Receiver Caching
نویسندگان
چکیده
منابع مشابه
Noisy Broadcast Networks with Receiver Caching
We study noisy broadcast networks with local cache memories at the receivers, where the transmitter can pre-store information even before learning the receivers’ requests. We mostly focus on packet-erasure broadcast networks with two disjoint sets of receivers: a set of weak receivers with all-equal erasure probabilities and equal cache sizes and a set of strong receivers with all-equal erasure...
متن کاملBroadcast Caching Networks with Two Receivers and Multiple Correlated Sources
The correlation among the content distributed across a cache-aided broadcast network can be exploited to reduce the delivery load on the shared wireless link. This paper considers a two-user three-file network with correlated content, and studies its fundamental limits for the worst-case demand. A class of achievable schemes based on a two-step source coding approach is proposed. Library files ...
متن کاملQuasi-consistency and Caching with Broadcast Disks
Among the concurrency control techniques proposed for transactional clients in broadcast environments, BCC-TI [6] has been demonstrated to have better performance than a simple adaptation of optimistic concurrency control with forward validation. Our work adapts BCC-TI to enforce quasi-consistency [3], and introduces caching. Through simulation experiments, we demonstrate the workload character...
متن کاملReliable Broadcast Scheme Initiated by Receiver In Ad Hoc Networks
In mobile ad hoc network, every link is wireless and every node is mobile. Those features make data lost easily as well as broadcasting inefficient and unreliable. Moreover, efficiency and reliability is conflicting each other. Hence it is hard to achieve both at a time with just one scheme. In this paper, we present the scheme to improve the reliability and efficiency of the broadcast protocol...
متن کاملComputing in fault tolerant broadcast networks and noisy decision trees
We consider a fault tolerant broadcast network of n processors each holding one bit of information. The goal is to compute a given Boolean function on the n bits. In each step, a processor may broadcast one bit of information. Each listening processor receives the bit that was broadcast with error probability bounded by a fixed constant . The errors in different steps, as well as for different ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2018
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2018.2835507